Is memory search governed by universal principles or idiosyncratic strategies?
نویسندگان
چکیده
منابع مشابه
Is memory search governed by universal principles or idiosyncratic strategies?
Laboratory paradigms have provided an empirical foundation for much of psychological science. Some have argued, however, that such paradigms are highly susceptible to idiosyncratic strategies and that many findings do not reflect fundamental cognitive principles but are instead artifacts of averaging across participants who employ different strategies. We developed a set of techniques to rigoro...
متن کاملOn Universal Restart Strategies for Backtracking Search
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomization and restarts can dramatically improve the performance of a backtracking algorithm on some instances. We consider the commonly occurring scenario where one is to solve an ensemble of instances using a backtracking algorith...
متن کاملLearning Adaptation Strategies by Introspective Reasoning about Memory Search
In case-based reasoning systems, the case adaptation process is traditionally controlled by static libraries of hand-coded adaptation rules. This paper proposes a method for learning adaptation knowledge in the form of 6dapLaLioa strategies of the type developed and hand-coded by Kass [90] . Adaptation strategies differ from standard adaptation rules in that they encode general memory search pr...
متن کاملThematic Roles – Universal , Particular , and Idiosyncratic Aspects
Thematic Roles (or Theta-Roles) are theoretical constructs that account for a variety of well known empirical facts, which are more or less clearly delimited. In other words, Theta-Roles are not directly observable, but they do have empirical content that is open to empirical observation. The objective of the present paper is to sketch the nature and content of Theta-Roles, distinguishing their...
متن کاملOn Universal Search Strategies for Multi-Criteria Optimization
We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium optimization problems characterized by weight vectors. The policy for switching between different weights is an adaptation of the universal restart strategy defined by [LSZ93] in the context of Las Vegas algorithms. We dem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental Psychology: General
سال: 2014
ISSN: 1939-2222,0096-3445
DOI: 10.1037/a0033715